Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems
نویسندگان
چکیده
منابع مشابه
Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems
Single Machine Scheduling Problems with Release Dates (SMSP) concern the optimal allocation of a set of jobs on a single machine, that cannot process more than one job at a time. Each job is ready for processing at a release date and it has to be processed without interruption. The goal is to minimize the total weighted completion time of the jobs. In this paper the time-indexed formulation is ...
متن کاملNear-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling
We consider the problem of minimizing the weighted sum of completion times on a single machine subject to bipartite precedence constraints where all minimal jobs have unit processing time and zero weight, and all maximal jobs have zero processing time and unit weight. For various probability distributions over these instances— including the uniform distribution—we show several “almost all”-type...
متن کاملSingle machine scheduling problems
In this paper, single machine scheduling problems with sequence dependent setup times are considered. The objective is to minimize the total weighted tardiness. The single machine total weighted tardiness (SMTWT) scheduling problems with sequence dependent setup times were proved to be strongly NP-hard. A recently developed meta-heuristic algorithm called as crow search algorithm is proposed to...
متن کاملProvably near-optimal solutions for very large single-row facility layout problems
The facility layout problem is a global optimization problem that seeks to arrange a given number of rectangular facilities so as to minimize the total cost associated with the (known or projected) interactions between them. This paper is concerned with the single-row facility layout problem (SRFLP), the one-dimensional version of facility layout that is also known as the one-dimensional space ...
متن کاملDual Decomposition of Single Machine Scheduling Problems
We design a fast ascent direction algorithm for the Lagrangian dual problem of the single-machine scheduling problem of minimizing total weighted completion time subject to precedence constraints. We show that designing such an algorithm is relatively simple if a scheduling problem is formulated in terms of the job completion times rather than as an 0-1 linear program. Also, we show that upon t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2005
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.1040.0069